نتایج جستجو برای: multi–stepiterative algorithm with bounded errors

تعداد نتایج: 9513054  

Journal: :international journal of nonlinear analysis and applications 2011
g.s. saluja

the purpose of this paper is to study and give the necessary andsufficient condition of strong convergence of the multi-step iterative algorithmwith errors for a finite family of generalized asymptotically quasi-nonexpansivemappings to converge to common fixed points in banach spaces. our resultsextend and improve some recent results in the literature (see, e.g. [2, 3, 5, 6, 7, 8,11, 14, 19]).

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه بوعلی سینا - دانشکده علوم پایه 1391

abstract: in this thesis, we focus to class of convex optimization problem whose objective function is given as a linear function and a convex function of a linear transformation of the decision variables and whose feasible region is a polytope. we show that there exists an optimal solution to this class of problems on a face of the constraint polytope of feasible region. based on this, we dev...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه ارومیه - دانشکده ادبیات و علوم انسانی 1390

the present study was concerned with exploring the frequency and linguistic focus of corrective feedback types given by novice and experienced female teachers working with young learners and compared it with those of elementary classes for adults. moreover, it aimed at measuring learners’ acknowledgement of teachers’ corrective feedback in the form of uptake in relation to linguistic coverage o...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه فردوسی مشهد - دانشکده ادبیات و علوم انسانی دکتر علی شریعتی 1393

this study aimed at examining the effects of iranian efl learners’ anxiety, ambiguity tolerance, and gender on their preferences for corrective feedback (cf, henceforth). the effects were sought with regard to the necessity, frequency, and timing of cf, types of errors that need to be treated, types of cf, and choice of correctors. seventy-five iranian efl students, twenty-eight males and forty...

Journal: :IACR Cryptology ePrint Archive 2010
Jintai Ding

In this paper, we present a new algorithm, such that, for the learning with errors (LWE) problems, if the errors are bounded – the errors do not span the whole prime finite field Fq but a fixed known subset of size D (D < q), which we call the learning with bounded errors (LWBE) problems, we can solve it with complexity O(n).

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه مازندران 1388

target tracking is the tracking of an object in an image sequence. target tracking in image sequence consists of two different parts: 1- moving target detection 2- tracking of moving target. in some of the tracking algorithms these two parts are combined as a single algorithm. the main goal in this thesis is to provide a new framework for effective tracking of different kinds of moving target...

پایان نامه :0 1374

the aim of this study has been to find answers for the following questions: 1. what is the effect of immediate correction on students pronunciation errors? 2. what would be the effect of teaching the more rgular patterns of english pronunciation? 3. is there any significant difference between the two methods of dealing with pronuciation errore, i. e., correction and the teaching of the regular ...

Journal: :IACR Cryptology ePrint Archive 2015
Martin R. Albrecht Rachel Player Sam Scott

The Learning with Errors (LWE) problem has become a central building block of modern cryptographic constructions. This work collects and presents hardness results for concrete instances of LWE. In particular, we discuss algorithms proposed in the literature and give the expected resources required to run them. We consider both generic instances of LWE as well as small secret variants. Since for...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید